Reduced decoder complexity and latency in pixel-domain Wyner–Ziv video coders
نویسندگان
چکیده
منابع مشابه
Reduced decoder complexity and latency in pixel-domain Wyner-Ziv video coders
In some video coding applications, it is desirable to reduce the complexity of the video encoder at the expense of a more complex decoder. Wyner–Ziv (WZ) video coding is a new paradigm that aims to achieve this. To allocate a proper number of bits to each frame, most WZ video coding algorithms use a feedback channel, which allows the decoder to request additional bits when needed. However, due ...
متن کاملImproved Pixel-Based Rate Allocation for Pixel-Domain Distributed Video Coders Without Feedback Channel
In some video coding applications, it is desirable to reduce the complexity of the video encoder at the expense of a more complex decoder. Distributed Video (DV) Coding is a new paradigm that aims at achieving this. To allocate a proper number of bits to each frame, most DV coding algorithms use a feedback channel (FBC). However, in some cases, a FBC does not exist. In this paper, we therefore ...
متن کاملOptimal decoder for block-transform based video coders
In this paper, we introduce a new decoding algorithm for DCT-based video encoders, such as Motion JPEG (M-JPEG), H26x, or MPEG. This algorithm considers not only the compression artifacts but also the ones due to transmission, acquisition or storage of the video. The novelty of our approach is to jointly tackle these two problems, using a variational approach. The resulting decoder is object-ba...
متن کاملLow-complexity feedback-channel-free distributed video coding using local rank transform
In this paper, we propose a new feedback-channel-free Distributed Video Coding (DVC) algorithm using Local Rank Transform (LRT). The encoder computes LRT by considering selected neighborhood pixels of Wyner-Ziv frame. The ranks from the modified LRT are merged, and their positions are entropy coded and sent to the decoder. In addition, means of each block of WynerZiv frame are also transmitted ...
متن کاملA new reduced-complexity sphere decoder for multiple antenna systems
Sphere decoding for multiple antenna systems has been shown to achieve near-ML performance with low complexity. However, the achievement of such an excellent performance-complexity tradeoff is highly dependent on the initial choice of sphere radius. In this paper, we present a new sphere decoding algorithm which is even less computationally complex than the original sphere decoder. Moreover, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Signal, Image and Video Processing
سال: 2007
ISSN: 1863-1703,1863-1711
DOI: 10.1007/s11760-007-0042-3